|
In mathematics, a Garside element is an element of an algebraic structure such as a monoid that has several desirable properties. Formally, if ''M'' is a monoid, then an element Δ of ''M'' is said to be a Garside element if the set of all right divisors of Δ, : is the same set as the set of all left divisors of Δ, : and this set generates ''M''. A Garside element is in general not unique: any power of a Garside element is again a Garside element. ==Garside monoid and Garside group== A Garside monoid is a monoid with the following properties: * Finitely generated and atomic; * Cancellative; * The partial order relations of divisibility are lattices; * There exists a Garside element. A Garside monoid satisfies the Ore condition for multiplicative sets and hence embeds in its group of fractions: such a group is a Garside group. A Garside group is biautomatic and hence has soluble word problem and conjugacy problem. Examples of such groups include braid groups and, more generally, Artin groups of finite Coxeter type. The name was coined by Dehornoy and Paris〔 to mark the work of F. A. Garside on the conjugacy problem for braid groups. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Garside element」の詳細全文を読む スポンサード リンク
|